PPOST: A Parallel Database in Main Memory
نویسندگان
چکیده
We present the PPOST-architecture (Persistent Parallel Object Store) for main-memory database systems on parallel computers, that is suited for applications with challenging performance requirements. The architecture takes full advantage of parallelism, large main memories and fast switching networks. An important property of this architecture is its excellent scaling behavior.
منابع مشابه
PPOST - Persistent Parallel Object STore
An architecture for a memory-resident, parallel and persistent objectstore (PPOST) is suggested. Several object-oriented databases might be built on top of PPOST. The term memory-resident (or main memory based) means that the primary storage device is main memory. Persistence is guaranteed automatically by managing secondary and stable storage devices (such as main memory with uninterrupted pow...
متن کاملA very fast parallel object store for very fast applications
An architecture for a memory-resident, Parallel and Persistent ObjectSTore (PPOST) is suggested. Different object-oriented databases might be built on top of PPOST. The term memory-resident (or main memory based) means that the primary storage device is main memory. Persistence is guaranteed automatically by managing secondary and stable storage devices (such as main memory with uninterrupted p...
متن کاملSimple and Efficient Transactions for a Distributed Object Store
Even the more or less “canonical”, lower-level architecture of information systems needs to be revisited from time to time. Notions like persistence and transactions belong traditionally to the area of database management systems. There are, however, many applications, such as CAD, VLSI design or simulation, which need persistence and could take advantage of transactions, but require especially...
متن کاملScalable Distributed Query Processing in Parallel Main-Memory Database Systems
The continuous increase in compute speed and main-memory capacity of modern servers triggered the development of a new generation of in-memory database systems. These systems completely rewrote the traditional database architecture to use main memory as primary storage. Discarding several now obsolete abstractions of disk-based database systems enabled unprecedented query performance on a singl...
متن کاملParallel Execution of kNN-Queries on in-memory K-D Trees
Parallel algorithms for main memory databases become an increasingly interesting topic as the amount of main memory and the number of CPU cores in computer systems increase. This paper suggests a method for parallelizing the k-d tree and its kNN search algorithm as well as suggesting optimizations. In empirical tests, the resulting modified k-d tree outperforms both the k-d tree and a paralleli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994